Multi-Player Agents in Cooperative TU-Games

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Harsanyi set for cooperative TU-games

A cooperative game with transferable utilities, or simply a TU-game, describes a situation in which players can obtain certain payo®s by cooperation. A solution mapping for these games is a mapping which assigns to every game a set of payo® distributions over the players in the game. Well-known solution mappings are the Core and the Weber set. In this paper we consider the mapping assigning to ...

متن کامل

A Formal Theory of Cooperative TU-Games

Results of game theory are often the keys to decisions of economical and political executives. They are also used to create internal tools of many decision making software. For example, coordination games may be cooperative games, when the players choose the strategies by a consensus decision making process, and game trees are used to represent some key cooperative games. Our theory of cooperat...

متن کامل

Repairing Multi-Player Games

Synthesis is the automated construction of systems from their specifications. Modern systems often consist of interacting components, each having its own objective. The interaction among the components is modeled by a multi-player game. Strategies of the components induce a trace in the game, and the objective of each component is to force the game into a trace that satisfies its specification....

متن کامل

Mastering multi-player games

We consider multi-player games, and the guarantees that a master player that plays on behalf of a set of players can offer them, without making any assumptions on the rationality of the other players. Our model consists of an (n + 1)-player game, with m strategies per player, in which a master player M forms a coalition with nontransferable utilities among n players, and the remaining player is...

متن کامل

On reasonable outcomes and the core in cooperative TU games

We provide a different axiomatization of the core interpreted as a reasonable set (Milnor, 1952) and introduce a new property, called max-intersection, related with the vector lattice structure of cooperative games with transferable utility. In particular, it is shown that the core is the only solution satisfying projection consistency, reasonability, max-intersection and modularity.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SSRN Electronic Journal

سال: 2011

ISSN: 1556-5068

DOI: 10.2139/ssrn.1978704